package com.test.daily.leetcode.y2022.m04.day0419.v009;

/**
 * @author Tom on 2022/4/19
 */
public class  Solution{
    public boolean isPalindrome(int x){
        String strs = Integer.toString(x);
        int N = strs.length();
        for(int i = 0; i < N /2; i++){
            if(strs.charAt(i) != strs.charAt(N - 1 - i)){
                return false;
            }
        }
        return true;
    }
}
